Planar growth generates scale-free networks
نویسندگان
چکیده
منابع مشابه
Planar growth generates scale-free networks
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in R, forming new connections to old nodes subject to the constraint that edges do not cross. The resulting network has a power law degree distribution, high clustering and the small world property. We argue that these characteristics are a consequence of the tw...
متن کاملScale-Free Cortical Planar Networks
1 University of California at Berkeley, Berkeley, CA 94720, USA 2 University of Memphis, Memphis TN 38152, USA 3 Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge CB3 0WB, UK. Research supported in part by NSF grants DMS-0505550, CNS-0721983 and CCF-0728928, and ARO grant W911NF-06-1-0076. 4 Mathematical Institute, University of Oxford, 24–29 St Gile...
متن کاملScale-free networks without growth
In this paper, we proposed an ungrowing scale-free network model, indicating the growth may not be a necessary condition of the self-organization of a network in a scale-free structure. The analysis shows that the degree distributions of the present model can varying from the Poisson form to the power-law form with the decrease of a free parameter α. This model provides a possible mechanism for...
متن کاملExactly scale-free scale-free networks
Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to model the growth and structure of scale-free networks. With so many different models of scale-free networks it is unclear what properties of scale-free networks ...
متن کاملGeometric fractal growth model for scale-free networks.
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power law with the exponent gamma. At each time step, each vertex generates its offspring, whose number is proportional to the degree of that vertex with proportionality constant m-1 (m>1). We consider the two cases: First, each offspring is connected to its parent vertex only, forming a tree structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2016
ISSN: 2051-1310,2051-1329
DOI: 10.1093/comnet/cnw005